A Formal Deenition of Bottom-up Embedded Push-down Automata and Their Tabulation Technique

The task of designing parsing algorithms for tree adjoining grammars could be simpliied by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent deeni-tion of this class of automata and, by removing the nite-state control, we obtain an alternative deenition which is adequate to deene a tabulation framework for this model of automata and to show the equivalence with respect to other kinds of automata accepting tree adjoining languages.